Searching Forward Complete Attack Graph Generation Algorithm Based on Hypergraph Partitioning
نویسندگان
چکیده
منابع مشابه
Ratio Cut Hypergraph Partitioning Using Bdd Based Mboa Optimization Algorithm
This paper deals with the k-way ratio cut hypergraph partitioning utilizing the Mixed discrete continuous variant of the Bayesian Optimization Algorithm (mBOA). We have tested our algorithm on three partitioning taxonomies: recursive minimum ratio cut, multi-way minimum ratio cut and recursive minimum cut bisection. We have also derived a new approach for modeling of Boolean functions using bin...
متن کاملA Serial Multilevel Hypergraph Partitioning Algorithm
The graph partitioning problem has many applications in scientific computing such as computer aided design, data mining, image compression and other applications with sparse-matrix vector multiplications as a kernel operation. In many cases it is advantageous to use hypergraphs as they, compared to graphs, have a more general structure and can be used to model more complex relationships between...
متن کاملAn Effective Algorithm for Multiway Hypergraph Partitioning
In this paper, we propose an effective multiway hypergraph partitioning algorithm. We introduce the concept of net gain and embed it in the selection of cell moves. Unlike traditional FM-based iterative improvement algorithms in which the selection of the next cell to move is only based on its cell gain, our algorithm selects a cell based on both its cell gain and the sum of all net gains for t...
متن کاملWalking Forward and Backward : towards Graph - Based Searching
Graphs are powerful vehicles to represent data objects that are interconnecting or inter-acting with each other. We explore random walks on various kinds of graph to addressdifferent searching and mining scenarios. This dissertation focuses on two symmetric formsof random walk called the forward walk and backward walk, which can be applied to enrichthree key tasks in searching a...
متن کاملA New Alert Correlation Algorithm Based on Attack Graph
Intrusion Detection Systems (IDS) are widely deployed in computer networks. As modern attacks are getting more sophisticated and the number of sensors and network nodes grows, the problem of false positives and alert analysis becomes more difficult to solve. Alert correlation was proposed to analyze alerts and to decrease false positives. Knowledge about the target system or environment is usua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2017
ISSN: 1877-0509
DOI: 10.1016/j.procs.2017.03.052